#pragma once
#include<iostream>
#include<stdio.h>
#include<queue>
#define valueType int
using namespace std;
namespace GIS20127
{
	struct node
	{
		valueType value;
		node* left = nullptr;
		node* right = nullptr;
	};



	void function(node* root)
	{
		queue<node*> que;
		que.push(root);
		int k = 1;
		while (que.empty())
		{
			while (k--)
			{
				node* cur = que.front();
				cout << cur->value;
				que.pop();
				que.push(cur->left);
				que.push(cur->right);
			}
			k=que.size();
		}
	}
};